Elimination of Complex RIAs without Automata
نویسنده
چکیده
We present an algorithm that eliminates complex role inclusion axioms (RIAs) from a SROIQ ontology preserving all logical consequences not involving non-simple roles. Unlike other existing methods, our algorithm does not explicitly construct finite automata recognizing the languages generated by the RIAs. Instead, it is formulated as a recursive expansion of universal restrictions, similar to well-known encodings of transitivity axioms.
منابع مشابه
An Extension of Regularity Conditions for Complex Role Inclusion Axioms
The description logic (DL) SROIQ [1] provides a logical foundation for the new version of the web ontology language OWL 2. In comparison to the DL SHOIN which underpins the first version of OWL, SROIQ provides several new constructors for classes and axioms. One of the new powerful features of SROIQ are so-called complex role inclusion axioms (RIAs) which allow for expressing implications betwe...
متن کاملNEW DIRECTION IN FUZZY TREE AUTOMATA
In this paper, our focus of attention is the proper propagationof fuzzy degrees in determinization of $Nondeterministic$ $Fuzzy$$Finite$ $Tree$ $Automata$ (NFFTA). Initially, two determinizationmethods are introduced which have some limitations (one inbehavior preserving and other in type of fuzzy operations). Inorder to eliminate these limitations and increasing theefficiency of FFTA, we defin...
متن کاملUnchain My EL Reasoner
We study a restriction of the classification procedure for EL where the inference rule for complex role inclusion axioms (RIAs) is applied in a “left-linear” way in analogy with the well-known procedure for computing the transitive closure of a binary relation. We introduce a notion of left-admissibility for a set of RIAs, which specifies when a subset of RIAs can be used in a left-linear way w...
متن کاملIndexing Rich Internet Applications Using Components-Based Crawling
Automatic crawling of Rich Internet Applications (RIAs) is a challenge because client-side code modifies the client dynamically, fetching server-side data asynchronously. Most existing solutions model RIAs as state machines with DOMs as states and JavaScript events execution as transitions. This approach fails when used with “real-life”, complex RIAs, because the size of the produced model is m...
متن کاملA Technique for Handling the Right Hand Side of Complex RIAs
This paper examines a new technique based on tableau, that allows one to introduce composition of roles from the right hand side of complex role inclusion axioms (RIAs). Our motivation comes from modeling product models in manufacturing systems. The series of papers, so far, have studied the extension of tableau algorithm for Description Logics (DLs) to capture complex RIAs. However, such RIAs ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2012